Generating fixed-length sequences satisfying any givennth-order transition probability matrix
نویسندگان
چکیده
منابع مشابه
Generating fixed-length sequences satisfying any given nth-order transition probability matrix.
An experimental design involving sequences of m distinct events can be conceptualized as an nth-order transition probability matrix specifying the probabilities with which each of the m distinct events is to follow certain n-grams. This paper describes a general method for constructing sequences of shortest possible length that satisfy any such matrix and presents a computer program that random...
متن کاملGenerating probabilistic Boolean networks from a prescribed transition probability matrix.
Probabilistic Boolean networks (PBNs) have received much attention in modeling genetic regulatory networks. A PBN can be regarded as a Markov chain process and is characterised by a transition probability matrix. In this study, the authors propose efficient algorithms for constructing a PBN when its transition probability matrix is given. The complexities of the algorithms are also analysed. Th...
متن کاملGenerating target probability sequences and events
Cryptography and simulation of systems require that events of pre-defined probability be generated. This paper presents methods to generate target probability events based on the oblivious transfer protocol and target probabilistic sequences using probability distribution functions.
متن کاملAsymptotic Valuations of Sequences Satisfying First Order Recurrences
Let tn be a sequence that satisfies a first order homogeneous recurrence tn = Q(n)tn−1, where Q ∈ Z[n]. The asymptotic behavior of the p-adic valuation of tn is described under the assumption that all the roots of Q in Z/pZ have nonvanishing derivative.
متن کاملOrthogonal matrix polynomials satisfying second order difference equations
We develop a method that allows us to construct families of orthogonal matrix polynomials of size N ×N satisfying second order difference equations with polynomial coefficients. The existence (and properties) of these orthogonal families strongly depends on the non commutativity of the matrix product, the existence of singular matrices and the matrix size N .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Behavior Research Methods, Instruments, & Computers
سال: 1999
ISSN: 0743-3808,1532-5970
DOI: 10.3758/bf03207715